Algorithmic Modeling and Complexity Fall 2002 Lecture 7 : 23 September
نویسندگان
چکیده
The Maximum Independent Set problem often arises in the following form: given n tasks which compete for the same resources, compute the largest set of tasks which can be performed at the same time without sharing resources. More generally, in case the tasks have weights (priorities), one may ask for the set of tasks of largest total weight which can be performed at the same time. This is called the Maximum Weighted Independent Set problem.
منابع مشابه
5 . Applications to streaming
In this lecture, we will see applications of communication complexity to proving lower bounds for streaming algorithms. Towards the end of the lecture, we will introduce combinatorial auctions, and we will see applications of communication complexity to auctions in the next lecture. The references for this lecture include Lecture 7 of Troy Lee’s course on communication complexity [Lee10], Lectu...
متن کاملLectures on Frugal Mechanism Design
These lecture notes cover two lectures from EECS 510, Algorithmic Mechanism Design, offered at Northwestern University in the Spring 2008 term. They cover the topic of frugality in mechanism design. Prerequisites for reading these lecture notes are basic understanding of algorithms and complexity as well as elementary calculus and probability theory. I will also assume that the reader has acces...
متن کاملComplexity ( for Algorithm Designers ) Lecture # 7 : Lower Bounds in Algorithmic Game Theory ∗
This lecture explains some applications of communication complexity to proving lower bounds in algorithmic game theory (AGT), at the border of computer science and economics. In AGT, the natural description size of an object is often exponential in a parameter of interest, and the goal is to perform non-trivial computations in time polynomial in the parameter (i.e., logarithmic in the descripti...
متن کاملAnt Colony Optimization and Swarm Intelligence, 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings
New updated! The ant colony optimization and swarm intelligence 6th international conference ants 2008 brussels belgium september 22 24 2008 proceedings lecture notes in computer science from the best author and publisher is now available here. This is the book that will make your day reading becomes completed. When you are looking for the printed book of this PDF in the book store, you may not...
متن کاملLecture Notes on Evasiveness of Graph Properties
These notes cover the first eight lectures of the class Many Models of Complexity taught by László Lovász at Princeton University in the Fall of 1990. The first eight lectures were on evasiveness of graph properties and related topics; subsequent lectures were on communication complexity and Kolmogorov complexity and are covered in other sets of notes. The fundamental question considered in the...
متن کامل